Algebraic multigrid for k-form Laplacians
نویسندگان
چکیده
In this paper we describe an aggregation-based algebraic multigrid method for the solution of discrete k-form Laplacians. Our work generalizes Reitzinger and Schöberl’s algorithm to higher-dimensional discrete forms. We provide conditions on the tentative prolongators under which the commutativity of the coarse and fine de Rham complexes is maintained. Further, a practical algorithm that satisfies these conditions is outlined, and smoothed prolongation operators and the associated finite element spaces are highlighted. Numerical evidence of the efficiency and generality of the proposed method is presented in the context of discrete Hodge decompositions. Copyright q 2008 John Wiley & Sons, Ltd.
منابع مشابه
A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians
In this paper, we develop a cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue. This vector has been found to have applications in fields such as graph partitioning and graph drawing. The algorithm is a purely algebraic approach based on a heavy edge coarsening scheme and pointwise...
متن کاملAlgebraic Multigrid for Discrete Differential Forms
Discrete differential forms arise in scientific disciplines ranging from computational electromagnetics to computer graphics. Examples include stable dis-cretizations of the eddy-current problem, topological methods for sensor network coverage, visualization of complex flows, surface parameterization, and the design of vector fields on meshes. In this thesis we describe efficient and scalable n...
متن کاملAn Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation
We consider the iterative solution of linear systems whose matrices are Laplacians of undirected graphs. Designing robust solvers for this class of problems is challenging due to the diversity of connectivity patterns encountered in practical applications. Our starting point is a recently proposed aggregation-based algebraic multigrid method that combines the recursive static elimination of the...
متن کاملAn Algebraic Multigrid Method for Quadratic Finite Element Equations of Elliptic and Saddle Point Systems in 3d
In this work, we propose a robust and easily implemented algebraic multigrid method as a stand-alone solver or a preconditioner in Krylov subspace methods for solving either symmetric and positive definite or saddle point linear systems of equations arising from the finite element discretization of the vector Laplacian problem, linear elasticity problem in pure displacement and mixed displaceme...
متن کاملA Parallel Solver for Graph Laplacians
Problems from graph drawing, spectral clustering, network flow and graph partitioning all can be expressed as Laplacian matrices. Theoretically fast approaches to solving these problems exist, but in practice these techniques are slow. Three practical approaches have been proposed and work well in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essenti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008